Truncated Kernel Projection Machine for Link Prediction
نویسندگان
چکیده
منابع مشابه
Kernel Projection Machine: a New Tool for Pattern Recognition
This paper investigates the effect of Kernel Principal Component Analysis (KPCA) within the classification framework, essentially the regularization properties of this dimensionality reduction method. KPCA has been previously used as a pre-processing step before applying an SVM but we point out that this method is somewhat redundant from a regularization point of view and we propose a new algor...
متن کاملSemi-supervised Penalized Output Kernel Regression for Link Prediction
Link prediction is addressed as an output kernel learning task through semi-supervised Output Kernel Regression. Working in the framework of RKHS theory with vectorvalued functions, we establish a new representer theorem devoted to semi-supervised least square regression. We then apply it to get a new model (POKR: Penalized Output Kernel Regression) and show its relevance using numerical experi...
متن کاملA Topical Graph Kernel for Link Prediction in Labeled Graphs
This paper proposes a solution to the problem of link prediction in labeled graphs with additional text information associated with the nodes. By fitting a topic model on the text corpus and some processing, we compute the topics of interest to a node. We propose a walk based graph kernel which incorporates the node’s interest and thus represents structural as well as textual information. We th...
متن کاملAlmost Random Projection Machine with Margin Maximization and Kernel Features
Almost Random Projection Machine (aRPM) is based on generation and filtering of useful features by linear projections in the original feature space and in various kernel spaces. Projections may be either random or guided by some heuristics, in both cases followed by estimation of relevance of each generated feature. Final results are in the simplest case obtained using simple voting, but linear...
متن کاملOn the Truncated Kernel Function
p|n p is the well-known kernel function and P (n) is the largest prime factor of n. In particular, we show that the maximal order of γ2(n) for n ≤ x is (1 + o(1))x/ log x as x → ∞ and that ∑n≤x 1/γ2(n) = (1+ o(1))ηx/ log x, where η = ζ(2)ζ(3)/ζ(6). We further show that, given any positive real number u < 1, limx→∞ 1 x#{n ≤ x : γ2(n) < xu} = limx→∞ 1 x#{n ≤ x : n/P (n) < xu} = 1− ρ(1/(1− u)), wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computing Science and Engineering
سال: 2016
ISSN: 1976-4677
DOI: 10.5626/jcse.2016.10.2.58